Random walks and isoperimetric profiles under moment conditions
نویسندگان
چکیده
Let G be a finitely generated group equipped with a finite symmetric generating set and the associated word length function | · |. We study the behavior of the probability of return for random walks driven by symmetric measures μ that are such that ∑ ρ(|x|)μ(x) < ∞ for increasing regularly varying or slowly varying functions ρ, for instance, s 7→ (1+s)α, α ∈ (0, 2], or s 7→ (1 + log(1 + s))ǫ, ǫ > 0. For this purpose we develop new relations between the isoperimetric profiles associated with different symmetric probability measures. These techniques allow us to obtain a sharp L-version of Erschler’s inequality concerning the Følner functions of wreath products. Examples and assorted applications are included.
منابع مشابه
The Dirichlet Problem at Infinity for Random Walks on Graphs with a Strong Isoperimetric Inequality
We study the spatial behaviour of random walks on innnite graphs which are not necessarily invariant under some transitive group action and whose transition probabilities may have innnite range. We assume that the underlying graph G satis-es a strong isoperimetric inequality and that the transition operator P is strongly reversible, uniformly irreducible and satisses a uniform rst moment condit...
متن کاملIsoperimetric profile of subgroups and probability of return of random walks on elementary solvable groups
We introduce a notion of large-scale foliation for metric measure spaces and we prove that if X is large-scale foliated by Y , and if Y satisfies a Sobolev inequality at large-scale, then so does X. In particular the Lp-isoperimetric of Y grows faster than the one of X. A special case is when Y = H is a closed subgroup of a locally compact group X = G. The class of elementary solvable groups is...
متن کاملUpper bounds for transition probabilities on graphs and isoperimetric inequalities
In this paper necessary and sufficient conditions are presented for heat kernel upper bounds for random walks on weighted graphs. Several equivalent conditions are given in the form of isoperimetric inequalities.
متن کاملGeometric Random Walks: A Survey∗
The developing theory of geometric random walks is outlined here. Three aspects — general methods for estimating convergence (the “mixing” rate), isoperimetric inequalities in Rn and their intimate connection to random walks, and algorithms for fundamental problems (volume computation and convex optimization) that are based on sampling by random walks — are discussed.
متن کاملUpper bounds for transition probabilities on graphs
In this paper necessary and sufficient conditions are presented for heat kernel upper bounds for random walks on weighted graphs. Several equivalent conditions are given in the form of isoperimetric inequalities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015